Data Distribution Algebras - A Formal Basis for Programming Using Skeletons
نویسنده
چکیده
Today there is no programming model or language support which ooers a uniform programming methodology on a wide variety of parallel architectures. In this paper functional languages are proposed as such a methodology using an extension of the concept of skeletons | higher-order functions coupled with parallel implementation templates. An essential part of the proposed methodology is the use of data distribution algebras as a structured language concept to specify distribution issues explicitly in a skeleton-based approach. It is shown how the skeleton composition problem can be solved using data distribution algebras. Finally the methodology is applied to the solution of partial diierential equations in the context of uid dynamics.
منابع مشابه
The transformational derivation of parallel programs using data distribution algebras and skeletons
The transformational derivation of parallel programs for distributed-memory architectures using skeleton-based approaches is one of the most promising methods for parallel program development. These approaches support the derivation of provably correct, eecient and portable parallel programs using a predeened set of encapsulated eeciently implemented parallel base algorithms. Encapsulation requ...
متن کاملForschungsberichte Des Fachbereichs Informatik Deriving Parallel Numerical Algorithms Using Data Distribution Algebras: Wang's Algorithm Deriving Parallel Numerical Algorithms Using Data Distribution Algebras: Wang's Algorithm
Parallel and distributed programming are much more diicult than the development of sequential algorithms due to data distribution issues and communication requirements. This paper presents a methodology that enables the abstract description of the distribution of data structures by means of overlapping covers that form data distribution algebras. Algorithms are formulated and derived by transfo...
متن کاملSTONE DUALITY FOR R0-ALGEBRAS WITH INTERNAL STATES
$Rsb{0}$-algebras, which were proved to be equivalent to Esteva and Godo's NM-algebras modelled by Fodor's nilpotent minimum t-norm, are the equivalent algebraic semantics of the left-continuous t-norm based fuzzy logic firstly introduced by Guo-jun Wang in the mid 1990s.In this paper, we first establish a Stone duality for the category of MV-skeletons of $Rsb{0}$-algebras and the category of t...
متن کاملSolving large systems of differential equations in parallel using covers and skeletons
The design and implementation of parallel algorithms for distributed memory architectures is much harder than the development of sequential algorithms. This is mainly due to the communication and synchronization that is necessary to manage distributed data correctly. This paper applies a methodology for the transformational derivation of parallel programs using data distribution algebras that e...
متن کاملParallel Genetic Algorithm Using Algorithmic Skeleton
Algorithmic skeleton has received attention as an efficient method of parallel programming in recent years. Using the method, the programmer can implement parallel programs easily. In this study, a set of efficient algorithmic skeletons is introduced for use in implementing parallel genetic algorithm (PGA).A performance modelis derived for each skeleton that makes the comparison of skeletons po...
متن کامل